A Comparison of Two Fully-Dynamic Delaunay Triangulation Methods
نویسنده
چکیده
Two fully-dynamic Delaunay triangulation methods, which differ in their point-location strategies, are proposed. One method is derived from the (bucket-based) BucketInc scheme of Su and Drysdale. The other is a new method based on a quadtree partitioning of the triangulation domain. The two methods are compared experimentally, and their relative merits discussed.
منابع مشابه
Fully Dynamic Constrained Delaunay Triangulations
We present algorithms for the efficient insertion and removal of constraints in Delaunay Triangulations. Constraints are considered to be points or any kind of polygonal lines. Degenerations such as edge overlapping, self-intersections or duplicated points are allowed and are automatically detected and fixed on line. As a result, a fully Dynamic Constrained Delaunay Triangulation is achieved, a...
متن کاملHCPO: an efficient insertion order for incremental Delaunay triangulation
ved. Among the five flavors [15] of sequential 2D Delaunay triangulation algorithms, incremental insertion methods (e.g., [8]) are most popular mainly because they are potentially dynamic, simple to implement and easy to be generalized to higher dimensions. However, normally they are not regarded as among the fastest methods. The basic principle of constructing Delaunay triangulation (DT) by in...
متن کاملA Comparison of Two Dynamic Mesh Methods in Fluid –Structure Interaction
Abstract. Two dynamic mesh methods— Radial Basis Function (RBF) method and Delaunay method which have been used widely in fluid-structure interaction recently were compared. Primarily, the basic theory of these two methods and the dynamic mesh process were presented. Furthermore, using the variable bandwidth sparse matrix storage technique, the computational efficiency of the RBF method can be ...
متن کاملApplication of Data Reduction Methods in Dynamic TIN Models to Topographic LIDAR Data
Comparisons of five data reduction methods associated with dynamic TIN models were conducted. All methods were applied to real world Light Detection and Ranging (LIDAR) topographic data. Data reduction is based on point selection by thresholding in dynamic Delaunay triangulation together with random point selection. The triangulation criteria used include Delaunay and hybrids of Delaunay and da...
متن کاملFast Updating of Delaunay Triangulation of Moving Points by Bi-cell Filtering
Updating a Delaunay triangulation when data points are slightly moved is the bottleneck of computation time in variational methods for mesh generation and remeshing. Utilizing the connectivity coherence between two consecutive Delaunay triangulations for computation speedup is the key to solving this problem. Our contribution is an effective filtering technique that confirms most bi-cells whose...
متن کامل